Discrete Logarithms : the E ectivenessof the Index Calculus

نویسندگان

  • Oliver Schirokauer
  • Damian Weber
  • Thomas Denny
چکیده

In this article we survey recent developments concerning the discrete logarithm problem. Both theoretical and practical results are discussed. We emphasize the case of nite elds, and in particular, recent modiications of the index calculus method, including the number eld sieve and the function eld sieve. We also provide a sketch of the some of the cryptographic schemes whose security depends on the intractibility of the discrete logarithm problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Elliptic Curve Discrete Logarithms and the Index Calculus

The discrete logarithm problem forms the basis of numerous cryptographic systems. The most eeective attack on the discrete logarithm problem in the multiplicative group of a nite eld is via the index calculus, but no such method is known for elliptic curve discrete logarithms. Indeed, Miller 23] has given a brief heuristic argument as to why no such method can exist. IN this note we give a deta...

متن کامل

Computing Discrete Logarithms with Quadratic Number Rings

At present, there are two competing index calculus variants for computing discrete logarithms in (Z/pZ)* in practice. The purpose of this paper is to summarize the recent practical experience with a generalized implementation covering both a variant of the Number Field Sieve and the Gaussian integer method. By this implementation we set a record with p consisting of 85 decimal digits. With rega...

متن کامل

A General Polynomial Sieve

An important component of the index calculus methods for finding discrete logarithms is the acquisition of smooth polynomial relations. Gordon and McCurley (1992) developed a sieve to aid in finding smooth Coppersmith polynomials for use in the index calculus method. We discuss their approach and some of the difficulties they found with their sieve. We present a new sieving method that can be a...

متن کامل

Integer Factorization and Computing Discrete Logarithms in Maple

As part of our MITACS research project at Simon Fraser University, we have investigated algorithms for integer factorization and computing discrete logarithms. We have implemented a quadratic sieve algorithm for integer factorization in Maple to replace Maple’s implementation of the MorrisonBrillhart continued fraction algorithm which was done by Gaston Gonnet in the early 1980’s. We have also ...

متن کامل

A new index calculus algorithm with complexity L(1/4+o(1)) in very small characteristic

In this paper, we describe a new algorithm for discrete logarithms in small characteristic. It works especially well when the characteristic is fixed. Indeed, in this case, we obtain a total complexity of L(1/4 + o(1)).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996